Wireless ATM Layouts for Chain Networks ∗ , ∗ ∗ MICHELE

Dynamic Layouts for Wireless ATM

A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract)

We investigate the time complexity of deciding the existence of layouts of virtual paths in high-speed networks, that enable a connection from one vertex to all others and have maximum hop count h and maximum edge load l , for a stretch factor of one. We prove that the problem of determining the existence of such layouts is NP-complete for every given values of h and l, except for the cases h =...

Optimal layouts on a chain ATM network

We study a routing problem which occurs in high-speed (ATM) networks, termed the “rooted virtual path layout problem” on chain networks. This problem is essentially a tree embedding problem on a chain host graph. We present four performance measures for the quality of such an embedding which have practical implications, and find optimal solutions for each of them. We first show that the search ...

Duality in Chain ATM Virtual Path Layouts

We present certain dualities occuring in the study of routing problems within ATM networks We concentrate on the one to many problem on a chain network in which one constructs a set of paths that enable connecting one vertex with all others in the network We consider the parameters of load the maximum number of paths that go through any single edge and hop count the maximum number of paths trav...

Dimensioning ATM Networks using 2-Layer Hierarchical Virtual Path Layouts

This paper addresses the problem of dimensioning multi-service ATM networks, where each service is supported by a different logical network. In the traditional approach, logical networks are configured with end-to-end VPCs, which greatly simplifies VCC admission control. This approach does not explore resource sharing gains since an end-to-end VPC bandwidth is assigned to each VCC flow. In this...